Two-level relationships and scale-free networks

Dynamic Source Routing Strategy for Two-Level Flows on Scale-Free Networks

Packets transmitting in real communication networks such as the Internet can be classified as time-sensitive or time-insensitive. To better support the real-time and time-insensitive applications, we propose a two-level flow traffic model in which packets are labeled as level-1 or level-2, and those with level-1 have higher priority to be transmitted. In order to enhance the traffic capacity of...

Exactly scale-free scale-free networks

Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...

Hierarchical Topologies for Large-scale Two-level Networks

We present in this paper some of the topological properties of an interesting class of Circulant graphs whose nodes are labeled by a subset of the Gaussian integers. Such graphs and the problems we solve on them have direct applications to the design of interconnection networks and, in addition, they can be considered in the design of perfect error-correcting codes for two-dimensional signal sp...

Deterministic Scale-Free Networks

Scale-free networks are abundant in nature, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in...

Scale-free networks